Graph polynomials derived from Tutte–Martin polynomials
نویسندگان
چکیده
منابع مشابه
Graph polynomials derived from Tutte-Martin polynomials
A graph polynomial q(G; ) has recently been studied byArratia et al. [The interlace polynomial: a new graph polynomial, in: Proceedings of the EleventhAnnual ACM-SIAM Symposium on Discrete Mathematics, San Francisco, CA, 2000, North-Holland, Amsterdam, pp. 237–245]. That polynomial can be derived from the restricted Tutte–Martin polynomial of an isotropic system, which we introduced [A. Bouchet...
متن کاملThe Polynomials of a Graph
In this paper, we are presented a formula for the polynomial of a graph. Our main result is the following formula: [Sum (d{_u}(k))]=[Sum (a{_kj}{S{_G}^j}(1))], where, u is an element of V(G) and 1<=j<=k.
متن کاملSome Graph Polynomials of the Power Graph and its Supergraphs
In this paper, exact formulas for the dependence, independence, vertex cover and clique polynomials of the power graph and its supergraphs for certain finite groups are presented.
متن کاملGraph polynomials from principal pivoting
The recursive computation of the interlace polynomial introduced by Arratia, Bollobás and Sorkin is defined in terms of a new pivoting operation on undirected simple graphs. In this paper, we interpret the new pivoting operation on graphs in terms of standard pivoting (on matrices). Specifically, we show that, up to swapping vertex labels, Arratia et al.’s pivoting operation on a graph is equiv...
متن کاملEvaluations of Graph Polynomials
A graph polynomial p(G, X̄) can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points X̄ = x̄0. In this paper we study the question how to prove that a given graph parameter, say ω(G), the size of the maximal clique of G, cannot be a fixed coefficient or the evaluation at any point of the Tutte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2005
ISSN: 0012-365X
DOI: 10.1016/j.disc.2004.07.028